Comparison of Spectral Clustering Methods

نویسندگان

  • Deepak Verma
  • Marina Meilă
چکیده

We take apart, combine and compare on real and artificial data the features of the four best-known spectral clustering algorithms. We find that the algorithms behave more similarly then expected, especially if the data are near a case called perfect, where three of the algorithms are equivalent.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories

In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...

متن کامل

A Comparison of Spectral Clustering Algorithms

Spectral Clustering has become quite popular over the last few years and several new algorithms have been published. In this paper, we compare several of the best-known algorithms from the point of view of clustering quality over artificial and real datasets. We implement many variations of the existing spectral algorithms and compare their performance to see which features are more important. ...

متن کامل

Comparison of Accuracy of Spectral Clustering and Cluster Ensembles Based on Co-occurrence Matrix

High accuracy of the results is very important task in any grouping problem (clustering). It determines effectiveness of the decisions based on them. Therefore in the literature there are proposed methods and solutions that main aim is to give more accurate results than traditional clustering algorithms (e.g. k-means or hierarchical methods). Examples of such solutions can be cluster ensembles ...

متن کامل

Thematic Fuzzy Clusters with an Additive Spectral Approach

This paper introduces an additive fuzzy clustering model for similarity data as oriented towards representation and visualization of activities of research organizations in a hierarchical taxonomy of the field. We propose a one-by-one cluster extracting strategy which leads to a version of spectral clustering approach for similarity data. The derived fuzzy clustering method, FADDIS, is experime...

متن کامل

The Comparison of Fuzzy Clustering Methods for Symbolic Interval-valued Data

Interval-valued data can find their practical applications in such situations as recording monthlyinterval temperatures at meteorological stations, daily interval stock prices, etc. The primary objectiveof the presented paper is to compare three different methods of fuzzy clustering for interval-valuedsymbolic data, i.e.: fuzzy c-means clustering, adaptive fuzzy c-means clustering a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015